Clustering HMM States for Symbolic Description of Tempo- ral Sequences

نویسندگان

  • Huizhen Yu
  • Eric L. Grimson
چکیده

We seek a high level abstraction not directly on states level, but as a function over states. By constructing the function we identify substructures in the topology of HMM that correspond to “macro” status. In order to construct the function, additional information – sparse manually labeled or automatically generated sources – is needed and task dependent. Different functions can be constructed for different tasks. On the other hand, from the resulting functions one can tell whether a task-dependent structure is captured by the HMM learned from historic data.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A language for expressing expert knowledge using fuzzy temporal rules

In this paper we undertake an initial ap proach to the formal de nition of a grammar that describes what we call Fuzzy Tempo ral Propositions FTPs or propositions with explicitly expressed information of a tempo ral type The grammar contemplates the double perspective of the problem it pro vides a syntactic description of the proposi tions that it models and a procedure seman tic criteria for e...

متن کامل

Structured Hidden Markov Model: A General Framework for Modeling Complex Sequences

Structured Hidden Markov Model (S-HMM) is a variant of Hierarchical Hidden Markov Model that shows interesting capabilities of extracting knowledge from symbolic sequences. In fact, the S-HMM structure provides an abstraction mechanism allowing a high level symbolic description of the knowledge embedded in S-HMM to be easily obtained. The paper provides a theoretical analysis of the complexity ...

متن کامل

Autoregressive clustering for HMM speech synthesis

The autoregressive HMM has been shown to provide efficient parameter estimation and high-quality synthesis, but in previous experiments decision trees derived from a non-autoregressive system were used. In this paper we investigate the use of autoregressive clustering for autoregressive HMM-based speech synthesis. We describe decision tree clustering for the autoregressive HMM and highlight dif...

متن کامل

HMM state clustering across allophone class boundaries

We present a novel approach to hidden Markov model (HMM) state clustering based on the use of broad phone classes and an allophone class entropy measure. Most state-of-the-art largevocabulary speech recognizers are based on context-dependent (CD) phone HMMs that use Gaussian mixture models for the state-conditioned observation densities. A common approach for robust HMM parameter estimation is ...

متن کامل

A Successive State Splitting Algorithm Based on the Mdl Criterion by Data-driven and Decision Tree Clustering

We propose a new Successive State Splitting (SSS) algorithm based on the Minimum Description Length (MDL) criterion to design tied-state HMM topologies automatically. The SSS algorithm is a mechanism for creating both temporal and contextual variations based on the Maximum Likelihood (ML) criterion. However, it also needs to empirically predetermine control parameters for use as stop criteria, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002